منابع مشابه
Pronouncing unknown words using multi-dimensional analogies
In this paper, a model of analogy-based learning is presented, whose main novelty is the crucial ability to produce analogies in multi-dimensional input and output spaces. Evaluations are performed on various word pronunciation tasks, revealing the effectiveness of such joint learning strategies.
متن کاملBalance properties of multi-dimensional words
A word u is called balanced if for any two factors v and w of u of equal length, we have ?1 jvj i ? jwj i 1 for each letter i, where jvj i denotes the number of occurrences of i in the factor v. The aim of this paper is to extend the notion of balance to multi-dimensional words. We rst characterise all balanced words on Z n. In particular we prove them to be fully periodic. We then give a quant...
متن کاملPredicate Encryption for Multi-dimensional Range Queries from Lattices
We construct a lattice-based predicate encryption scheme for multi-dimensional range and multidimensional subset queries. Our scheme is selectively secure and weakly attribute-hiding, and its security is based on the standard learning with errors (LWE) assumption. Multi-dimensional range and subset queries capture many interesting applications pertaining to searching on encrypted data. To the b...
متن کاملLattices of Logical Fragments over Words
This paper introduces an abstract notion of fragments of monadicsecond-order logic. This concept is based on purely syntactic closure proper-ties. We show that over finite words, every logical fragment defines a lattice oflanguages with certain closure properties. Among these closure properties areresiduals and inverse C-morphisms. Here, depending on certain closure proper-t...
متن کاملNotes on some Distance-Based Invariants for 2-Dimensional Square and Comb Lattices
We present explicit formulae for the eccentric connectivity index and Wiener index of 2-dimensional square and comb lattices with open ends. The formulae for these indices of 2-dimensional square lattices with ends closed at themselves are also derived. The index for closed ends case divided by the same index for open ends case in the limit N →&infin defines a novel quantity we call compression...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2004
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2004.02.016